After, we consider the problem for minimizing total weighted tardiness on a single continuous batch processing machine. It is proved that the problem is a NP-hard problem. In regard to the problem with constant processing time, a optimal algorithm is represented. 之后,讨论了极小化加权误工数的单机连续型批调度问题,证明了该问题为NP-难问题,对工件基本加工时间恒等的特殊情况给出了最优算法。